The beowulf strategy aims at minimizing computation time Beowulf策略的目的是最小化計算時間。
Moreover , the proposed method reduces the computation time greatly 并且,該方法能夠大大減少運算所需的時間。
So a good msa program tries to get a best balance between alignment quality and computation time 所以,那些取得對齊質量與對齊時間最佳平衡的程序就是好的多序列對齊程序。
To reduce the computation time , which is often too long in conventional genetic algorithm , the idea of tabu search is employed 配電網絡重構,本文采用了改進的遺傳算法與禁忌搜索法相結合。
The optimization quality and computation time of set covering arid tabu search algorithms were analyzed and compared 摘要分析和比較了集合覆蓋和禁忌搜索兩種高效布局算法的優化性能和計算時間。